An Adaptive Scheduling Scheme for Fair Bandwidth Allocation

نویسندگان

  • Wei Liu
  • Wenqing Cheng
  • Jianhua He
  • Chunhui Le
  • Zongkai Yang
چکیده

Class-based service differentiation is provided in DiffServ networks. However, this differentiation will be disordered under dynamic traffic loads due to the fixed weighted scheduling. An adaptive weighted scheduling scheme is proposed in this paper to achieve fair bandwidth allocation among different service classes. In this scheme, the number of active flows and the subscribed bandwidth are estimated based on the measurement of local queue metrics, then the scheduling weights of each service class are adjusted for the per-flow fairness of excess bandwidth allocation. This adaptive scheme can be combined with any weighted scheduling algorithm. Simulation results show that, comparing with fixed weighted scheduling, it effectively improve the fairness of excess bandwidth allocation.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Fair Scheduling in Internet Routers

ÐInput buffered switch architecture has become attractive for implementing high performance routers and expanding use of the Internet sees an increasing need for quality of service. It is challenging to provide a scheduling technique that is both highly efficient and fair in resource allocation. In this paper, we first introduce an iterative fair scheduling(i FS) scheme for input buffered switc...

متن کامل

Implementing fair bandwidth allocation schemes in hose-modelled VPN - Communications, IEE Proceedings-

The virtual private network (VPN) provides customers with predictable and secure network connections over a shared network infrastructure. The recently proposed hose model for VPNs has desirable properties in terms of greater flexibility and better multiplexing gain. However, the ‘classic’ fair bandwidth allocation scheme introduces the issue of low overall utilisation in this model; furthermor...

متن کامل

Dynamic bandwidth allocation with fair scheduling for WCDMA systems

Dynamic bandwidth allocation (DBA) will play an important role in future broadband wireless networks, including the 3G and 4G WCDMA systems. A code-division generalized processor sharing (CDGPS) fair scheduling DBA scheme is proposed for WCDMA systems. The scheme exploits the capability of the WCDMA physical layer, reduces the computational complexity in the link layer, and allows channel rates...

متن کامل

A stateless active queue management scheme for approximating fair bandwidth allocation

We investigate the problem of providing a fair bandwidth allocation to each of flows that share the outgoing link of a congested router. The buffer at the outgoing link is a simple FIFO, shared by packets belonging to the flows. We devise a simple packet dropping scheme, called CHOKe, that discriminates against the flows which submit more packets/sec than is allowed by their fair share. By doin...

متن کامل

CHOKE, A Stateless Active Queue Management Scheme for Approximating Fair Bandwidth Allocation

We investigate the problem of providing a fair bandwidth allocation to each of n flows that share the outgoing link of a congested router. The buffer at the outgoing link is a simple FIFO, shared by packets belonging to the n flows. We devise a simple packet dropping scheme, called CHOKe, that discriminates against the flows which submit more packets/sec than is allowed by their fair share. By ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005